Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages
نویسندگان
چکیده
Based on different concepts to obtain a finer notion of language recognition via finite monoids we develop an algebraic structure called typed monoid. This leads to an algebraic description of regular and non regular languages. We obtain for each language a unique minimal recognizing typed monoid, the typed syntactic monoid. We prove an Eilenberg-like theorem for varieties of typed monoids as well as a similar correspondence for classes of languages with weaker closure properties.
منابع مشابه
An Eilenberg Theorem for Arbitrary Languages
In algebraic language theory one investigates formal languages by relating them to finite algebras. The most important result along these lines is Eilenberg’s celebrated variety theorem [7]: varieties of languages (classes of regular finite-word languages closed under boolean operations, derivatives and preimages of monoid morphisms) correspond bijectively to pseudovarieties of monoids (classes...
متن کاملFormations of Monoids, Congruences, and Formal Languages
The main goal in this paper is to use a dual equivalence in automata theory started in [RBBCL13] and developed in [BBCLR14] to prove a general version of the Eilenberg-type theorem presented in [BBPSE12]. Our principal results confirm the existence of a bijective correspondence between formations of (non-necessarily finite) monoids, that is, classes of monoids closed under taking epimorphic ima...
متن کاملGeneralized Eilenberg Theorem I: Local Varieties of Languages
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg’s theorem. This theorem states that the lattice of all boolean algebras of regular languages over an alphabetΣ closed under derivatives is isomorphic to the lattice of all pseudovarieties ofΣ-generated monoids. By applying our method to different cat...
متن کاملEilenberg theorems for many-sorted formations
A theorem of Eilenberg establishes that there exists a bi-jection between the set of all varieties of regular languages and the set of all varieties of finite monoids. In this article after defining, for a fixed set of sorts S and a fixed S-sorted signature Σ, the concepts of formation of congruences with respect to Σ and of formation of Σ-algebras, we prove that the algebraic lattices of all Σ...
متن کاملOn Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular languages with classes of more complex algebraic objects. Such generalized varieties also have natural counterparts formed by classes of finite automata equipped wi...
متن کامل